An Attempt for Description of Quasi { Autopoietic
نویسنده
چکیده
In this paper, we attempt to describe Autopoi-etic Systems using a mathematical framework of Metabolism{Repair Systems. Our description does not strictly reeect pure autopoiesis, and can only represent quasi{autopoietic systems. However , we believe that this attempt will spur discussions on the formal description of autopoiesis and the relation to mental and social systems, and so on, and we dare to propose a rough model.
منابع مشابه
A Description of Quasi { Autopoietic Systemsbased on the Framework of ( M , R
In this paper, we discuss a description of autopoietic systems using a mathematical framework of (M,R) systems. Our attempt may be very thoughtless because of the diiculty in interpreting autopoiesis within the framework of the naive set theory. Accordingly, our description does not strictly reeect pure autopoiesis, and can only represent quasi{autopoietic systems. Nevertheless, we believe that...
متن کاملDually quasi-De Morgan Stone semi-Heyting algebras I. Regularity
This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended $lor$-De Morgan law introduced in cite{Sa12}. Then, using this result and the results of cite{Sa12}, we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) ...
متن کاملThe Organization of the Living: A Theory of the Living Organization
The fundamental feature that characterizes living systems is autonomy, and any account of their organization as systems that can exist as individual unities must show what autonomy is as a phenomenon proper to them, and how it arises in their operation as such unities. Accordingly the following is proposed. (1) That autonomy in living systems is a feature of self-production (autopoiesis), and t...
متن کاملDeterministic Autopoietic Automata
In 2001, van Leeuwen and Wiedermann [1] have defined evolving interactive systems, in particular sequences of interactive finite automata with global states, to model infinite computations on an ever changing machine or system of machines. Modern computation does not just happen on an individual machine for a fixed time, but it goes on forever over an unbounded number of software and hardware c...
متن کاملAutopoietic automata: Complexity issues in offspring-producing evolving processes
We introduce a new formal computational model designed for studying the information transfer among the generations of offspring-producing evolving machines — so-called autopoietic automata. These can be seen as nondeterministic finite state transducers whose “program” can become a subject of their own processing. An autopoietic automaton can algorithmically generate an offspring controlled by a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997